package com.tgy.leetcode;

/**
 * @Author: tgy
 * @Date: 12/5/20 10:05 AM
 *
 * https://leetcode-cn.com/problems/string-rotation-lcci/
 */
public class 面试题_01_09_字符串轮转 {

    public boolean isFlipedString(String s1, String s2) {

        if (s1 == null || s2 == null || s1.length() != s2.length()) {

            return false;
        }

        return (s1 + s1).contains(s2);
    }

}
